Shortest path problem - PDFSEARCH.IO - Document Search Engine

Shortest path problem
Results: 829

#	Item
701	Describing and Simulating Internet Routes J´er´emie Leguay1 , Matthieu Latapy2 , Timur Friedman1 , and Kav´e Salamatian1 1 LIP6 – CNRS and Universit´e Pierre et Marie Curie, 8, rue du Capitaine Scott, 75015 Paris, Add to Reading List Source URL: jeremie.leguay.free.fr Language: English - Date: 2011-05-06 06:36:06 Network theory Shortest path problem Routing Shortest path tree Graph Degree distribution Distance Breadth-first search Centrality Mathematics Graph theory Theoretical computer science
702	Chapter 2 Discrete Planning Steven M. LaValle University of Illinois Add to Reading List Source URL: planning.cs.uiuc.edu Language: English - Date: 2012-04-20 17:07:06 Operations research Theoretical computer science Combinatorial optimization Routing algorithms A* search algorithm Optimization problem Dynamic programming Shortest path problem Algorithm Mathematics Applied mathematics Search algorithms
703	Describing and Simulating Internet Routes Jérémie Leguay Université Pierre et Marie Curie (LIP6 /CNRS) Collaboration with: Matthieu Latapy, Timur Friedman, Kavé Salamatian Add to Reading List Source URL: jeremie.leguay.free.fr Language: English - Date: 2011-05-06 06:36:05 Network theory Theoretical computer science Routing Shortest path problem Routing protocol Link-state routing protocol Network architecture Routing algorithms Mathematics
704	November[removed]LIDS-P-2276 RELAX-IV: A Faster Version of the RELAX Code for Solving Minimum Cost Flow Problems Add to Reading List Source URL: web.mit.edu Language: English - Date: 2001-07-10 15:50:54 Systems scientists Network flow Operations research Convex optimization Auction algorithm Dimitri Bertsekas Interior point method Minimum-cost flow problem Shortest path problem Mathematics Applied mathematics Mathematical optimization
705	Effective routing and scheduling in adversarial queueing networks Jay Sethuraman ∗ Chung-Piaw Teo Add to Reading List Source URL: www.columbia.edu Language: English - Date: 2004-08-26 16:34:07 Computer networking Online algorithms Data transmission Adversary model Analysis of algorithms Packet switching Routing Shortest path problem Linear programming Computing Theoretical computer science Mathematics
706	♦ SPIDER: A Simple and Flexible Tool for Design and Provisioning of Protected Lightpaths in Optical Networks R. Drew Davis, Krishnan Kumaran, Gang Liu, and Iraj Saniee Optical devices are poised to form the core of the Add to Reading List Source URL: cm.bell-labs.com Language: English - Date: 2001-08-08 20:52:10 Fiber-optic communications Theoretical computer science Technology Routing Wavelength-division multiplexing Shortest path problem Optical fiber Optical mesh network Routing and wavelength assignment Telecommunications Network architecture Multiplexing
707	1 Network Tomography via Compressed Sensing Mohammad H. Firooz, Student Member, IEEE, Sumit Roy, Fellow, IEEE, Electrical Engineering Department University of Washington, Seattle, WA, USA. Add to Reading List Source URL: www.ee.washington.edu Language: English - Date: 2010-09-16 20:44:55 Graph Adjacency matrix Bipartite graph Shortest path problem Topology Expander graph Logical matrix Directed graph Bipartite double cover Graph theory Mathematics Matrices
708	Complex networks and decentralized search algorithms Jon Kleinberg∗ Abstract. The study of complex networks has emerged over the past several years as a theme spanning many disciplines, ranging from mathematics and com Add to Reading List Source URL: isites.harvard.edu Language: English - Date: 2013-03-08 16:03:30 Mathematics Social networks Community building Small world experiment Small-world network Complex network Shortest path problem Routing Connectivity Graph theory Network theory Networks
709	SociaLite: Datalog Extensions for Efficient Social Network Analysis Jiwon Seo Stephen Guo Add to Reading List Source URL: mobisocial.stanford.edu Language: English - Date: 2013-01-06 04:24:43 Network theory Compiler construction Networks Shortest path problem Directed acyclic graph Datalog Static single assignment form Centrality Tree Graph theory Mathematics Theoretical computer science
710	Combinatorial Optimization and Statistical Physics Phillip M. Duxbury, Condensed Matter Theory, MSU Add to Reading List Source URL: www.pa.msu.edu Language: English - Date: 2007-02-21 08:51:29 Combinatorial optimization Spanning tree Lattice models Network theory Ising model Cut Matching Maximum flow problem Shortest path problem Mathematics Theoretical computer science Graph theory

UPDATE